Introduction Fractions of Recurrence Operators Algorithms Conclusion and Future Works Chebyshev Expansions for Solutions of Linear Differential Equations Alexandre Benoit, Joint work with Bruno Salvy

Source URL: issac2009.kias.re.kr

• Algebra
• Orthogonal polynomials
• Approximation theory
• Chebyshev polynomials
• Recurrence relation
• Numerical analysis
• Chebfun
• Polynomial
• Differential equation
• Integral
• Pafnuty Chebyshev
• Chebyshev equation

CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016

Source URL: theory.stanford.edu

• NP-complete problems
• Knapsack problem
• Set cover problem
• Steiner tree problem
• Vertex cover
• Approximation algorithm
• Greedy algorithm
• Dynamic programming
• Minimum spanning tree
• Algorithm
• Time complexity
• NP

1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum

Source URL: cs-www.cs.yale.edu

• Complexity classes
• PSPACE-complete
• IP
• Generalized geography
• PSPACE
• PP
• ArthurMerlin protocol
• Computational complexity theory
• NP
• P
• NEXPTIME
• Reduction

Theoretical Computer Science–2863 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs

Source URL: www.cs.huji.ac.il

• Computational complexity theory
• Approximation algorithms
• Complexity classes
• Operations research
• NP-complete problems
• Polynomial-time approximation scheme
• Travelling salesman problem
• Steiner tree problem
• APX
• Optimization problem
• Combinatorial optimization
• NP

Online Algorithms Susanne Albers Stefano Leonardiy Over the past twelve years, online algorithms have received considerable research interest. Online

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Theoretical computer science
• Metrical task system
• K-server problem
• Adversary model
• Algorithm
• Competitive analysis
• Randomized algorithm
• Approximation algorithm
• Computational learning theory

Approximating Connected Facility Location Problems via Random Facility Sampling and Core Detouring Thomas Rothvoß Institute of Mathematics ´

Source URL: www.math.washington.edu

• NP-complete problems
• Operations research
• Approximation algorithms
• Steiner tree problem
• Facility location problem
• APX
• Approximation

Continuous Network Design Hardness and Approximation Max Klimm Combinatorial Optimization and Graph Algorithms Technische Universität Berlin

Source URL: www.maths.lse.ac.uk

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni1 and Thomas Rothvoß2 1

Source URL: www.math.washington.edu

• Computational complexity theory
• Operations research
• Facility location problem
• Steiner tree problem
• Shortest path problem
• Approximation algorithm
• Low-rank approximation

T HEOREMS AS PROBLEMS S TRONG REDUCTIONS O MNISCIENT REDUCTIONS

Source URL: ludovicpatey.com

• Computational complexity theory
• Computability theory
• Structural complexity theory
• Approximation algorithms
• Reduction
• L
• Simple set
• Approximation-preserving reduction

Introduction to LP and SDP Hierarchies Madhur Tulsiani Princeton University Local Constraints in Approximation Algorithms Linear Programming (LP) or Semidefinite Programming

Source URL: www.win.tue.nl